A Sufficient Condition for Secure Ping–Pong Protocols

A Sufficient Condition for Secure Ping-Pong Protocols

A sufficient condition for secure ping–pong protocols is repretsented. This condition, called name– suffixing, is essentially to insert identities of participants in messages. We prove its sufficiency and discuss the feature of security in terms of name–suffixing.

A Sharp Sufficient Condition for Sparsity Pattern Recovery

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

A Sufficient Condition for Hyperinvariance

A linear transformation on a finite-dimensional complex linear space has the property that all of its invariant subspaces are hyperinvariant if and only if its lattice of invariant subspaces is distributive [1]. It is shown that an operator on a complex Hilbert space has this property if its lattice of invariant subspaces satisfies a certain distributivity condition. 1. Preliminaries. Throughou...

A Necessary and Sufficient Condition for Transcendency

As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...

A sufficient normality condition for Turing's formula